منابع مشابه
A note on the parity assignment problem
The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The accuracy of any instructions, formulae and drug doses should be independently verified with primary sources. The publisher shall not be liable for any loss, actions, claims, proceedings, demand or costs or damages whatsoever or howsoever caused...
متن کاملA note on the assignment problem with uniform preferences
Motivated by a problem of scheduling unit-length jobs with weak preferences over timeslots, the random assignment problem (also called the house allocation problem) is considered on a uniform preference domain. For the subdomain in which preferences are strict except possibly for the class of unacceptable objects, Bogomolnaia and Moulin characterized the probabilistic serial mechanism as the on...
متن کاملNote on a matroid with parity conditon
This paper presents a theorem concerning a matroid with the parity condition. The theorem provides matroid generalizations of graph-theoretic results of Lewin [3] and Gallai [1]. Let M=(E, F) be a matroid, where E is a finite set of elements and F is the family of independent sets of M (in this paper, we presuppose a knowledge of matroid theory; our standard reference is Welsh [4]). Assume that...
متن کاملA note on parity constrained orientations
This note extends the results of Frank, Jordán, and Szigeti [1] on parity constrained orientations with connectivity requirements. Given a hypergraph H, a non-negative intersecting supermodular set function p, and a preferred in-degree parity for every node, a formula is given on the minimum number of nodes with wrong in-degree parity in an orientation of H covering p. It is shown that the mini...
متن کاملA Note on Bar-Gera's Algorithm for the Origin-Based Traffic Assignment Problem
Recently Bar-Gera (2002) proposed a quasi-Newton method for the origin-based formulation of the user equilibrium traffic assignment problem. This note shows that Bar-Gera’s algorithm may generate negative second-order derivative, leading to a “wrong search direction” which compromises the overall convergence performance. We prove that this shortcoming can be overcome by approximating the second...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2007
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331930701421038